Bisimulation-Based Comparisons for Interpretations in Description Logics

نویسندگان

  • Ali Rezaei Divroodi
  • Linh Anh Nguyen
چکیده

We study comparisons between interpretations in description logics with respect to “logical consequences” of the form of semipositive concepts (like semi-positive concept assertions). Such comparisons are characterized by conditions similar to the ones of bisimulations. The simplest among the considered logics is a variant of PDL (propositional dynamic logic). The others extend that logic with inverse roles, nominals, quantified number restrictions, the universal role, and/or the concept constructor for expressing the local reflexivity of a role. The studied problems are: preservation of semi-positive concepts with respect to comparisons, the Hennessy-Milner property for comparisons, and minimization of interpretations that preserves semi-positive concepts.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bisimulation Equivalence in Description Logics and Its Applications Author's Declaration Supervisor's Declaration

In this dissertation, we study bisimulations and bisimulation-based comparisons in a uniform way for a large class of description logics that extend ALCreg (a variant of propositional dynamic logic) with an arbitrary set of features among I (inverse roles), O (nominals), Q (qualified number restrictions), U (the universal role), Self (local reflexivity of a role) as well as role axioms. We give...

متن کامل

Comparing the Expressiveness of Description Logics

This work studies the expressiveness of the description logics that extend ALCreg (a variant of PDL) with any combination of the features: inverse roles, nominals, quantified number restrictions, the universal role, the concept constructor for expressing the local reflexivity of a role. We compare the expressiveness of these description logics w.r.t. concepts, positive concepts, TBoxes and ABox...

متن کامل

Computing Bisimulation-Based Comparisons

By using the idea of Henzinger et al. for computing the similarity relation, we give an efficient algorithm, with complexity O((m + n)n), for computing the largest bisimulation-based autocomparison and the directed similarity relation of a labeled graph for the setting without counting successors, where m is the number of edges and n is the number of vertices. Moreover, we provide the first alg...

متن کامل

On Bisimulations for Description Logics

We formulate bisimulations for useful description logics. The simplest among the considered logics is a variant of PDL (propositional dynamic logic). The others extend that logic with inverse roles, nominals, quantified number restrictions, the universal role, and/or the concept constructor ∃r.Self. They also allow role axioms. We give results about invariance of concepts, TBoxes and ABoxes, pr...

متن کامل

Bisimulation-Based Concept Learning in Description Logics

Concept learning in description logics (DLs) is similar to binary classification in traditional machine learning. The difference is that in DLs objects are described not only by attributes but also by binary relationships between objects. In this paper, we develop the first bisimulation-based method of concept learning in DLs for the following setting: given a knowledge base KB in a DL, a set o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013